Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
681	Reductions between Disjoint NP-Pairs Christian Glaßer ∗ ¨ Informatik IV Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2003-04-21 14:49:45 Computability theory Structural complexity theory Complexity classes Mathematical optimization NP-complete P versus NP problem Turing reduction Oracle machine Time complexity Theoretical computer science Computational complexity theory Applied mathematics
682	Review of1 How to Think about Algorithms by Jeff Edmonds Cambridge University Press, 2008 xiv+450 pages, ISBN: [removed]Hardback, £55.00, $99.00), [removed]Paperback, £19.99, $36.99) Add to Reading List Source URL: www.eecs.yorku.ca Language: English - Date: 2009-01-14 12:03:51 Operations research Analysis of algorithms Mathematical logic Algorithms Mathematical optimization Greedy algorithm Recursion Time complexity Search algorithm Mathematics Applied mathematics Theoretical computer science
683	Complete Distributional Problems, Hard Languages, and Resource-Bounded Measure A. Pavan† Alan L. Selman‡ Department of Computer Science University at Buffalo Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 12:14:50 Complexity classes NP-complete P Time complexity Reduction Many-one reduction P versus NP problem NP-hard Theoretical computer science Computational complexity theory Applied mathematics
684	Much Ado about Functions Alan L. Selman Department of Computer Science State University of New York at Buffalo Buffalo, NY[removed]Abstract Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 08:38:33 Structural complexity theory Complexity classes Functions and mappings Computability theory NP Multivalued function Oracle machine Time hierarchy theorem Inverse function Theoretical computer science Mathematics Computational complexity theory
685	A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP Ashish V. Naik Alan L. Selman† Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 12:46:24 Complexity classes Structural complexity theory Mathematical optimization Conjectures P versus NP problem NP P Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
686	Disjoint NP-Pairs Christian Glaßer 1 Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2003-02-17 11:57:27 Complexity classes P versus NP problem NP-complete NP Oracle machine PP P Many-one reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics
687	c 2014 Society for Industrial and Applied Mathematics SIAM J. DISCRETE MATH. Vol. 28, No. 1, pp. 342–371 Add to Reading List Source URL: 140.109.74.92 Language: English - Date: 2014-03-12 09:54:52 Computational complexity theory Asymptotic analysis Big O notation Mathematical notation Symbol Exponentiation Time complexity Analysis of algorithms Mathematics Applied mathematics
688	Foreword Raul Espejo ([removed]) Stafford Beer’s organisational cybernetics is making more sense today than at the time since he published Brain of the Firm in[removed]Key ideas of the Viable System Model (VSM Add to Reading List Source URL: www.syncho.com Language: English - Date: 2011-11-04 15:46:51 Systems science Knowledge Viable system model Complexity Soft systems methodology Self-organization Variety System Strategic management Systems theory Science Cybernetics
689	Optimal heuristic algorithms for the image of an injective function∗ Edward A. Hirsch† Dmitry Itsykson† Valeria Nikolaenko‡ Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-08-01 04:42:41 Complexity classes Analysis of algorithms Quantum complexity theory Probabilistic complexity theory Randomized algorithm NP PP Algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
690	On an optimal randomized acceptor for graph nonisomorphism∗ Edward A. Hirsch†,‡ Dmitry Itsykson† November 9, 2011 Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-11-09 06:46:56 Analysis of algorithms Mathematical optimization Complexity classes Graph coloring NP-complete Randomized algorithm P versus NP problem NP Time complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE